Robustness in Geometric Computations
نویسنده
چکیده
Geometric computation software tends to be fragile and fails occasionally. This robustness problem is rooted in the difficulty of making unambiguous decisions about incidence and nonincidence, fundamentally impairing layering the geometry software reliably. Additionally, geometric operations tend to have a large number of special and singular cases, further adding to the difficulty of creating dependable geometric software. We review the problem origins and ways to address it.
منابع مشابه
A Generic Lazy Evaluation Scheme for Exact Geometric Computations
We present a generic C++ design to perform efficient and exact geometric computations using lazy evaluations. Exact geometric computations are critical for the robustness of geometric algorithms. Their efficiency is also critical for most applications, hence the need for delaying the exact computations at run time until they are actually needed. Our approach is generic and extensible in the sen...
متن کاملAn analysis and comparison of parameterization-based computation of differential quantities for discrete surfaces
Normals and curvatures are fundamental for geometric modeling and computer-aided design, but their accurate computations on discrete surfaces are challenging. Two types of methods, namely height-function based and parameterization based polynomial fittings, are well founded mathematically and can be proven to deliver convergent results under reasonable assumptions. However, the numerical behavi...
متن کاملManaging uncertainty and discontinuous condition numbers in geometric computation
We consider operations on subdivision surfaces under the strict robustness requirement that these floating-point computations return an object with the same topological form as the true solution. The problems involved may however be ill-conditioned, and defined in terms of uncertain data, and even supplementary interval arithmetic may not ensure robustness. Trapping mechanisms are therefore pro...
متن کاملRobustness and Randomness
Robustness problems of computational geometry algorithms is a topic that has been subject to intensive research efforts from both computer science and mathematics communities. Robustness problems are caused by the lack of precision in computations involving floatingpoint instead of real numbers. This paper reviews methods dealing with robustness and inaccuracy problems. It discusses approaches ...
متن کامل2 the Nature of Geometric Computation
Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising from numerical errors. Section 45.1 provides background on these problems. Although nonrobustness is already an issue in “purely numerical” computation, the problem is compounded in “geometric computation.” In Section 45.2 we characterize such computations. Researchers trying to create robust geometric ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Inf. Sci. Eng.
دوره 1 شماره
صفحات -
تاریخ انتشار 2001